Word posets, with applications to Coxeter groups
نویسنده
چکیده
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then apply the partially ordered sets to Coxeter groups. Some results are a proof that enumerating the reduced words of elements of Coxeter groups is #P-complete, a recursive formula for computing the number of commutation classes of reduced words, as well as stronger bounds on the maximum number of commutation classes than were previously known. This also allows us to improve the known bounds on the number of primitive sorting networks.
منابع مشابه
Polygon Posets and the Weak Order of Coxeter Groups
We explore the connection between polygon posets, which is a class of ranked posets with an edgelabeling which satisfies certain 'polygon properties', and the weak order of Coxeter groups. We show that every polygon poset is isomorphic to a join ideal in the weak order, and for Coxeter groups where no pair of generators have infinite order the converse is also true. The class of polygon posets ...
متن کاملOn the Coxeter transformations for Tamari posets
A relation between the anticyclic structure of the dendriform operad and the Coxeter transformations in the Grothendieck groups of the derived categories of modules over the Tamari posets is obtained.
متن کاملShortest path poset of finite Coxeter groups
We define a poset using the shortest paths in the Bruhat graph of a finite Coxeter group W from the identity to the longest word in W , w0. We show that this poset is the union of Boolean posets of rank absolute length of w0; that is, any shortest path labeled by reflections t1, . . . , tm is fully commutative. This allows us to give a combinatorial interpretation to the lowest-degree terms in ...
متن کاملWord Processing in Coxeter Groups∗
Several de nitions, facts, and theorems stated during the recent talks given by Dr. Donnelly relating to the word problem for Coxeter groups are restated in 1 to provide some background information and notation. Three other facts, due to Casselman, are also stated and proved as lemmas in this section. In 2, we state and prove Tits' Theorem for the word problem on Coxeter groups. Finally, we c...
متن کاملAlgebraic and combinatorial properties of zircons
In this paper we introduce and study a new class of posets, that we call zircons, which includes all Coxeter groups partially ordered by Bruhat order. We prove that many of the properties of Coxeter groups extend to zircons often with simpler proofs: in particular, zircons are Eulerian posets and the Kazhdan-Lusztig construction of the Kazhdan-Lusztig representations can be carried out in the c...
متن کامل